Routing multiple work teams to minimize latency in post-disaster road network restoration

• Post-disaster road clearance problem is addressed with the total latency objective and multiple work teams positioned at different depots. A mathematical model formulated to optimize under synchronization of teams. Two heuristic approaches are introduced: 1) a multi-level network based 2) cluster-first-route-second embedded into local search. Computational tests show viability both heuristics respect run times optimality gaps. After disaster, often roads damaged blocked, hindering accessibility for relief efforts. It essential dispatch restore blocked by or repair operations. With goal enabling access between critical locations in disaster area shortest time, we propose algorithms that determine schedule routes We minimize reaching locations, where location defined as time it takes from start operation until its first visit one Coordination among needed since some edges might be opened certain team utilized other later on. First, develop an exact handles coordination requirement. observing intractability this formulation, introduce two methods lower bounding procedure. In method, on novel representation yields solutions disjoint paths. Given does not coordinate teams, present matheuristic approach search algorithm together additional step obtain alternative higher quality shorter time. test our data sets coming real literature (180 instances) randomly generated ones (640 observe superiority obtained incorporation coordination.